Speeding Up FPGA Placement via Partitioning and Multithreading
نویسندگان
چکیده
منابع مشابه
Speeding Up Robot Control Software Through Seamless Integration With FPGA
Today robotic computing systems are usually implemented using general purpose processors because of their accessibility and simplicity which do not require specific knowledge. However, this approach restricts several optimization opportunities and may not always satisfy performance, cost, and energy requirements [5]. FPGA infrastructures can be considered as a good solution for these issues, es...
متن کاملSpeeding up computations via molecular biology
We show how to extend the recent result of Adleman 1] to use biological experiments to directly solve any NP problem. We, then, show how to use this method to speedup a large class of important problems.
متن کاملSpeeding up Graph Algorithms via Switching Classes
Given a graph G, a vertex switch of v ∈ V (G) results in a new graph where neighbors of v become nonneighbors and vice versa. This operation gives rise to an equivalence relation over the set of labeled digraphs on n vertices. The equivalence class of G with respect to the switching operation is commonly referred to as G’s switching class. The algebraic and combinatorial properties of switching...
متن کاملSpeeding Up Secure Computations via Embedded Caching
Most existing work on Privacy-Preserving Data Mining (PPDM) focus on enabling conventional data mining algorithms with the ability to run in a secure manner in a multi-party setting. Although various algorithms in data mining have been enhanced to incorporate secure mechanisms for data privacy preservation, their computation performance is far too high to allow them to be practically useful. Th...
متن کاملDistributed Data Placement via Graph Partitioning
With the widespread use of shared-nothing clusters of servers, there has been a proliferation of distributed object stores that offer high availability, reliability and enhanced performance for MapReducestyle workloads. However, relational workloads cannot always be evaluated efficiently using MapReduce without extensive data migrations, which cause network congestion and reduced query throughp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Reconfigurable Computing
سال: 2009
ISSN: 1687-7195,1687-7209
DOI: 10.1155/2009/514754